Function-indexed empirical processes based on an infinite source Poisson transmission stream

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Empirical Testing of the Infinite Source Poisson Data Traffic Model

The infinite source Poisson model is a fluid queue approximation of network data transmission that assumes that sources begin constant rate transmissions of data at Poisson time points for random lengths of time. This model has been a popular one as analysts attempt to provide explanations for observed features in telecommunications data such as self-similarity, long range dependence and heavy ...

متن کامل

Empirical processes indexed by estimated functions

We consider the convergence of empirical processes indexed by functions that depend on an estimated parameter η and give several alternative conditions under which the “estimated parameter” ηn can be replaced by its natural limit η0 uniformly in some other indexing set Θ. In particular we reconsider some examples treated by Ghoudi and Remillard [Asymptotic Methods in Probability and Statistics ...

متن کامل

ON THE INFINITE ORDER MARKOV PROCESSES

The notion of infinite order Markov process is introduced and the Markov property of the flow of information is established.

متن کامل

Poisson limits for empirical point processes

Define the scaled empirical point process on an independent and identically distributed sequence {Yi : i ≤ n} as the random point measure with masses at a n Yi. For suitable an we obtain the weak limit of these point processes through a novel use of a dimension-free method based on the convergence of compensators of multiparameter martingales. The method extends previous results in several dire...

متن کامل

On Infinite Words Determined by Indexed Languages

We characterize the infinite words determined by indexed languages. An infinite language L determines an infinite word α if every string in L is a prefix of α. If L is regular or context-free, it is known that α must be ultimately periodic. We show that if L is an indexed language, then α is a morphic word, i.e., α can be generated by iterating a morphism under a coding. Since the other directi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2012

ISSN: 1350-7265

DOI: 10.3150/11-bej367